Quality of service constrained task mapping and scheduling algorithm for wireless sensor networks

Efficient task mapping and scheduling is a crucial factor for achieving high performance in multimedia wireless sensor networks. This paper presents Quality of Service (QoS) constrained task mapping and scheduling algorithm for multi-hop clustered wireless sensor networks. With the objective of meeting high performance and providing real-time guarantees, the algorithm simultaneously schedules the computation tasks and associated communication events of real time applications. The proposed scheduling algorithm exploits linear task clustering, augmented with task duplication and migration approach. Thus, reduces inter-task communication costs. Meanwhile, mitigates local communication overhead incurred due to communication medium contention. Experimental results and comparisons, based on both randomly generated application graphs, as well as graphs of some real-world applications, demonstrate that the proposed task mapping and scheduling scheme significantly surpasses previous approaches in terms of both quality and cost of schedules, which are mainly presented with deadline missing ratio, schedule length, and total application energy consumption.